Edge Domination on Bipartite Permutation Graphs and Cotriangulated Graphs

نویسندگان

  • Anand Srinivasan
  • K. Madhukar
  • P. Nagavamsi
  • C. Pandu Rangan
  • Maw-Shang Chang
چکیده

An edge dominating set D of graph G = (V; E) is a set of edges such that every edge not in D is adjacent to at least an edge in D. In this paper we develop polynomial time algorithms for nding a minimum edge dominating set for a cotriangulated graph and a bipartite permutation graph.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving the Weighted Efficient Edge Domination Problem on Bipartite Permutation Graphs

Given a simple graph G = (V, E), an edge (u, u) E E is said to dominate itself and any edge (u,x) or (u,x), where x E V. A subset D C E is called an efficient edge dominating set of G if all edges in E are dominated by exactly one edge of D. The efficient edge domination problem is to find an efficient edge dominating set of minimum size in G. Suppose that each edge e E E is associated with a r...

متن کامل

On the signed Roman edge k-domination in graphs

Let $kgeq 1$ be an integer, and $G=(V,E)$ be a finite and simplegraph. The closed neighborhood $N_G[e]$ of an edge $e$ in a graph$G$ is the set consisting of $e$ and all edges having a commonend-vertex with $e$. A signed Roman edge $k$-dominating function(SREkDF) on a graph $G$ is a function $f:E rightarrow{-1,1,2}$ satisfying the conditions that (i) for every edge $e$of $G$, $sum _{xin N[e]} f...

متن کامل

Weighted efficient domination problem on some perfect graphs

Given a simple graph G = (V; E), a vertex v ∈ V is said to dominate itself and all vertices adjacent to it. A subset D of V is called an e cient dominating set of G if every vertex in V is dominated by exactly one vertex in D. The e cient domination problem is to 3nd an e cient dominating set of G with minimum cardinality. Suppose that each vertex v ∈ V is associated with a weight. Then, the we...

متن کامل

Coverings, matchings and paired domination in fuzzy graphs using strong arcs

The concepts of covering and matching in fuzzy graphs using strong arcs are introduced and obtained the relationship between them analogous to Gallai’s results in graphs. The notion of paired domination in fuzzy graphs using strong arcs is also studied. The strong paired domination number γspr of complete fuzzy graph and complete bipartite fuzzy graph is determined and obtained bounds for the s...

متن کامل

Perfect edge domination and efficient edge domination in graphs

Let G = (V; E) be a /nite and undirected graph without loops and multiple edges. An edge is said to dominate itself and any edge adjacent to it. A subset D of E is called a perfect edge dominating set if every edge of E \ D is dominated by exactly one edge in D and an e cient edge dominating set if every edge of E is dominated by exactly one edge in D. The perfect (e cient) edge domination prob...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Inf. Process. Lett.

دوره 56  شماره 

صفحات  -

تاریخ انتشار 1995